The module M 1 QN 3 Version 3 . 3 ( October 2009 )
نویسندگان
چکیده
4 Implementation remarks 12 4.1 Calling sequence in direct communication . . . . . . . . 12 4.2 Calling sequence in reverse communication . . . . . . . . 13 4.3 More on some arguments . . . . . . . . . . . . . . . . . 15 4.4 More on some output modes . . . . . . . . . . . . . . . . 15 4.5 Cold start and warm restart . . . . . . . . . . . . . . . . 16 4.6 Usage for very large scale problems . . . . . . . . . . . . 17
منابع مشابه
Long cycles in hypercubes with distant faulty vertices
In this paper, we study long cycles in induced subgraphs of hypercubes obtained by removing a given set of faulty vertices such that every two faults are distant. First, we show that every induced subgraph of Qn with minimum degree n− 1 contains a cycle of length at least 2 − 2f where f is the number of removed vertices. This length is the best possible when all removed vertices are from the sa...
متن کاملThe Panpositionable Hamiltonicity of k-ary n-cubes
The hypercube Qn is one of the most well-known and popular interconnection networks and the k-ary n-cubeQn is an enlarged family from Qn that keeps many pleasing properties from hypercubes. In this article, we study the panpositionable hamiltonicity of Qn for k ≥ 3 and n ≥ 2. Let x, y of V (Qn) be two arbitrary vertices and C be a hamiltonian cycle of Qn. We use dC(x, y) to denote the distance ...
متن کاملOn 14-Cycle-Free Subgraphs of the Hypercube
It is shown that the size of a subgraph of Qn without a cycle of length 14 is of order o(|E(Qn)|). 1 Subgraphs of the hypercube with no C4 or C6 For given two graphs, Q and P , let ex(Q,P ) denote the generalized Turán number, i.e., the maximum number of edges in a P -free subgraph of Q. The n-dimensional hypercube, Qn, is the graph with vertex-set {0, 1}n and edges assigned between pairs diffe...
متن کاملProof of Locke’s Conjecture, I
Locke’s conjecture (L) states that the binary hypercube Qn with k deleted vertices of each parity is Hamiltonian if n ≥ k + 2. In 2003, S. C. Locke and R. Stong published in The American Mathematical Monthly a proof of (L) for the case k = 1. In 2007, in the paper Path coverings with prescribed ends in faulty hypercubes the authors proved (L) for every k ≤ 4 and formulated the following conject...
متن کاملFinding Topic Words for Hierarchical Summarization (DRAFT)
! "$#% & ' ( *) ' ,+! ./. *0 ( *) ' ,+ 1"2 ! 3) / 4#% . *) ' ,5768 2) :91 9 :;< =" ?>1 ! ./. ( *) @ ) ./ A #B 94 ' C) D ' 1 ' E./ F"4 1"E ! =) G" > H) ' E) I49 = / ?;J) LKM N#% N 4) 0 . *) HOE *) ) '9 = FO2 9 9 HO4 / 9 0 ) ?) B ' H) .E+M;: < 9 9 I4 . ) ' #P) :QN . 0 ) SR4 )DTU ' .E5WV< X H) .Y Z/ M) HO[ *) ) ? ./ \ " &) = L 1 ]./ F" ^5U_X N './9 3) N ; ) ? KM `) a94 F E./ ?) F" 29 9 ' ! "[#% b ...
متن کامل